基于多点空间直线拟合的调炮精度检测方法

针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。     

水喷淋对建筑外立面火灾烟气向室内蔓延控制的研究

高层建筑外保温材料发生火灾后,研究着火层房间内的自动喷水灭火系统对火灾烟气向室内蔓延的控制效果,为高层建筑性能化防火设计提供理论支持。运用火灾动力学软件FDS模拟高层建筑外保温材料火灾,对比分析在不同喷射位置的自动喷水灭火系统作用下的室内平均CO浓度和温度等烟气特性参数。综合比较发现,将喷头置于窗上方向下喷淋能有效地降低室内平均CO浓度和平均温度。对于由高层建筑外保温材料引起的火灾,室内自动喷水灭火系统喷头相对于窗户的位置决定其对火灾烟气蔓延控制的效果。     

语用学理论在影视对白翻译中的应用

影视对白与影视剧中的情境紧密相连,而语用学正是研究在不同的语言交际环境下如何理解和运用语言的。因此将语用学理论应用到影视对白翻译中,对提高影视对白翻译质量、准确生动地再现原剧作的思想性和艺术性、让目的语观众产生与原文观众相同的感受具有重要的指导意义。在翻译实践中,应坚持等效原则、会话合作原则及关联原则。     

试论课件制作中的色彩搭配和方法

色彩搭配在课件制作中具有表现教学内容、烘托教学气氛的重要作用,对学习者有着强烈的情绪影响和心理导示作用。制作中恰当地运用这一艺术手段来表达授课内容,合理地进行艺术加工,就会锦上添花,取得事半功倍的教学效果。针对当前课件制作中色彩搭配普遍存在的问题,运用色彩的概念、含义,搭配的原则、规律和方法,给出了解决办法。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

浅析军事演讲语言的特点

军事演讲在古今中外广泛存在,并以其独有的语言特色发挥着激发官兵斗志、鼓舞部队士气的作用。在进行军事演讲时,应遵循其“通俗晓畅,口语化强;精练准确,逻辑性强;善用军语,军事鼓动性强;生动形象,乐感性强”的语言特点,更好地发挥军事演讲的作用。     

在求“变”中推进西南边防部队转型发展

西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求"变"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010